A New Mathematical Model for Evolutionary Games on Finite Networks of Players

نویسندگان

  • Dario Madeo
  • Chiara Mocenni
چکیده

A new mathematical model for evolutionary games on graphs is proposed to extend the classical replicator equation to finite populations of players organized on a network with generic topology. Classical results from game theory, evolutionary game theory and graph theory are used. More specifically, each player is placed in a vertex of the graph and he is seen as an infinite population of replicators which replicate within the vertex. At each time instant, a game is played by two replicators belonging to different connected vertices, and the outcome of the game influences their ability of producing offspring. Then, the behavior of a vertex player is determined by the distribution of strategies used by the internal replicators. Under suitable hypotheses, the proposed model is equivalent to the classical replicator equation. Extended simulations are performed to show the dynamical behavior of the solutions and the potentialities of the developed model.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust Opponent Modeling in Real-Time Strategy Games using Bayesian Networks

Opponent modeling is a key challenge in Real-Time Strategy (RTS) games as the environment is adversarial in these games, and the player cannot predict the future actions of her opponent. Additionally, the environment is partially observable due to the fog of war. In this paper, we propose an opponent model which is robust to the observation noise existing due to the fog of war. In order to cope...

متن کامل

Dynamic system of strategic games

Maybe an event can't be modeled completely through one game but there is more chance with several games. With emphasis on players' rationality, we present new properties of strategic games, which result in production of other games. Here, a new attitude to modeling will be presented in game theory as dynamic system of strategic games and its some applications such as analysis of the clash betwe...

متن کامل

A BI-OBJECTIVE PROGRAMMING APPROACH TO SOLVE MATRIX GAMES WITH PAYOFFS OF ATANASSOV’S TRIANGULAR INTUITIONISTIC FUZZY NUMBERS

The intuitionistic fuzzy set has been applied to game theory very rarely since it was introduced by Atanassov in 1983. The aim of this paper is to develop an effective methodology for solving matrix games with payoffs of Atanassov’s triangular intuitionistic fuzzy numbers (TIFNs). In this methodology, the concepts and ranking order relations of Atanassov’s TIFNs are defined. A pair of bi-object...

متن کامل

Conjectural variations in aggregative games: An evolutionary perspective

Suppose that in symmetric aggregative games, in which payoffs depend only on a player’s strategy and on an aggregate of all players’ strategies, players have conjectures about the reaction of the aggregate to marginal changes in their strategy. The players play a conjectural variation equilibrium, which determines their fitness payoffs. The paper shows that only consistent conjectures can be ev...

متن کامل

A Closed-Form Formula for the Fair Allocation of Gains in Cooperative N-Person Games

Abstract   This paper provides a closed-form optimal solution to the multi-objective model of the fair allocation of gains obtained by cooperation among all players. The optimality of the proposed solution is first proved. Then, the properties of the proposed solution are investigated. At the end, a numerical example in inventory control environment is given to demonstrate the application and t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1307.1670  شماره 

صفحات  -

تاریخ انتشار 2013